Joint Task Allocation and PU Placement For Energy Efficient Heterogeneous MPSoCs

نویسندگان

  • Amr M. A. Hussien
  • Ahmed M. Eltawil
  • Rahul Amin
  • Jim Martin
چکیده

Energy Management for multi-mode Software Defined Radio (SDR) systems remains a daunting challenge. In this paper, we focus on the issue of task allocation for multi-processor based systems with hybrid processing resources that can be reconfigured to support various operations. With the objective of minimizing energy, we present an analytical probabilistic model that considers static, dynamic, configuration and communication energy components for multiple applications characterized by certain probabilities of execution. Furthermore, we propose a fast, energy aware static task mapping heuristic to minimize the average overall energy consumption. In addition, the heuristic proposes re-ordering for the processing units for further energy reduction. Simulation results show that the proposed mapping heuristic is capable of achieving results that are within 20% of the optimal solution while providing orders of magnitude speedup in processing time. Further saving is achievable via joint mapping and placement.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluating Energy-Aware Task Allocation Strategies for MPSOCS

Because of current market trends, the evaluation of task allocation strategies in multiprocessor system-on-chips (MPSoCs) must take into account both performance and energy consumption. Furthermore, complex interconnection structures, such as networks-on-chip (NoCs), must be considered. Simulators for the evaluation of energy consumption of detailed communication patterns in NoCs are available,...

متن کامل

A hierarchical run-time adaptive resource allocation framework for large-scale MPSoC systems

In the embedded computer system domain,MPSoC systems have become increasingly popular due to the ever-increasing performance demands of modern embedded applications. The number of processing elements in these MPSoCs also steadily increases. Whereas current MPSoCs still contain a limited number of processing elements, future MPSoCs will feature tens up to hundreds of (heterogeneous) processing e...

متن کامل

Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs Techical report

This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph characterizing a target application and a target architecture with alternative memory and computation resources, we compute an allocation and schedule minimizing the expected value of communication cost, being the communica...

متن کامل

Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs

This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph characterizing a target application and a target architecture with alternative memory and computation resources, we compute an allocation and schedule minimizing the expected value of communication cost, being the communica...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011